- resolved problem
- решенная задача
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
Resolved — Resolve Re*solve (r?*z?lv ), v. t. [imp. & p. p. {Resolved} ( z?lvd ); p. pr. & vb. n. {Resolving}.] [L. resolvere, resolutum, to untie, loosen, relax, enfeeble; pref. re re + solvere to loosen, dissolve: cf. F. r[ e]soudare to resolve. See… … The Collaborative International Dictionary of English
problem — an unwanted and often irreversible condition The word is used in many phrases to conceal truth or inadequacy. Thus a cash problem in an individual is a shortage of money, and not a superfluity or a lack of pockets to put it in. In a company … How not to say what you mean: A dictionary of euphemisms
Problem plays (Shakespeare) — In Shakespeare studies, the term problem plays normally refers to three plays that William Shakespeare wrote between the late 1590s and the first years of the seventeenth century: All s Well That Ends Well , Measure for Measure and Troilus and… … Wikipedia
problem — noun /pɹɒbləm/ a) A difficulty that has to be resolved or dealt with. b) A question to be answered, schoolwork exercise. Ant: solution … Wiktionary
Arthropod head problem — The arthropod head problem is a long standing zoological dispute concerning the segmental composition of the heads of the various arthropod groups, and how they are evolutionarily related to each other. While the dispute has historically centered … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Minkowski problem — In differential geometry, the Minkowski problem, named after Hermann Minkowski, asks, for a given strictly positive real function ƒ defined on sphere, for a strictly convex compact surface S whose Gaussian curvature at the point x equals ƒ(n(x)) … Wikipedia
Two envelopes problem — The two envelopes problem is a puzzle or paradox within the subjectivistic interpretation of probability theory; more specifically within Bayesian decision theory. This is still an open problem among the subjectivists as no consensus has been… … Wikipedia
Sleeping Beauty problem — The Sleeping Beauty problem is a puzzle in probability theory: a sleeper is to be woken once or twice according to the toss of a coin, and asked her credence for the coin having come up heads.The problem was originally stated by Adam Elga [ [http … Wikipedia
Hilbert's sixteenth problem — was posed by David Hilbert at the Paris conference of the International Congress of Mathematicians in 1900, together with the other 22 problems. The original problem was posed as the Problem of the topology of algebraic curves and surfaces (… … Wikipedia
Mutilated chessboard problem — a b c d e f g h … Wikipedia